Interconnection networks for parallel and distributed computing

Parallel computers are generally either shared-memory machines or distributed- memory machines. There are currently technological limitations on shared-memory architectures and so parallel computers utilizing a large number of processors tend tube distributed-memory machines. We are concerned solely with distributed-memory multiprocessors. In such machines, the dominant factor inhibiting faster global computations is inter-processor communication. Communication is dependent upon the topology of the interconnection network, the routing mechanism, the flow control policy, and the method of switching. We are concerned with issues relating to the topology of the interconnection network. The choice of how we connect processors in a distributed-memory multiprocessor is a fundamental design decision. There are numerous, often conflicting, considerations to bear in mind. However, there does not exist an interconnection network that is optimal on all counts and trade-offs have to be made. A multitude of interconnection networks have been proposed with each of these networks having some good (topological) properties and some not so good. Existing noteworthy networks include trees, fat-trees, meshes, cube-connected cycles, butterflies, Möbius cubes, hypercubes, augmented cubes, k-ary n-cubes, twisted cubes, n-star graphs, (n, k)-star graphs, alternating group graphs, de Bruijn networks, and bubble-sort graphs, to name but a few. We will mainly focus on k-ary n-cubes and (n, k)-star graphs in this thesis. Meanwhile, we propose a new interconnection network called augmented k-ary n- cubes. The following results are given in the thesis.1. Let k ≥ 4 be even and let n ≥ 2. Consider a faulty k-ary n-cube Q(^k_n) in which the number of node faults f(_n) and the number of link faults f(_e) are such that f(_n) + f(_e) ≤ 2n - 2. We prove that given any two healthy nodes s and e of Q(^k_n), there is a path from s to e of length at least k(^n) - 2f(_n) - 1 (resp. k(^n) - 2f(_n) - 2) if the nodes s and e have different (resp. the same) parities (the parity of a node Q(^k_n) in is the sum modulo 2 of the elements in the n-tuple over 0, 1, ∙∙∙ , k - 1 representing the node). Our result is optimal in the sense that there are pairs of nodes and fault configurations for which these bounds cannot be improved, and it answers questions recently posed by Yang, Tan and Hsu, and by Fu. Furthermore, we extend known results, obtained by Kim and Park, for the case when n = 2.2. We give precise solutions to problems posed by Wang, An, Pan, Wang and Qu and by Hsieh, Lin and Huang. In particular, we show that Q(^k_n) is bi-panconnected and edge-bipancyclic, when k ≥ 3 and n ≥ 2, and we also show that when k is odd, Q(^k_n) is m-panconnected, for m = (^n(k - 1) + 2k - 6’ / ‘_2), and (k -1) pancyclic (these bounds are optimal). We introduce a path-shortening technique, called progressive shortening, and strengthen existing results, showing that when paths are formed using progressive shortening then these paths can be efficiently constructed and used to solve a problem relating to the distributed simulation of linear arrays and cycles in a parallel machine whose interconnection network is Q(^k_n) even in the presence of a faulty processor.3. We define an interconnection network AQ(^k_n) which we call the augmented k-ary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube Q(^k_n) has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n-cube Q(^k_n) - is a Cayley graph (and so is vertex-symmetric); has connectivity 4n - 2, and is such that we can build a set of 4n - 2 mutually disjoint paths joining any two distinct vertices so that the path of maximal length has length at most max{{n- l)k- (n-2), k + 7}; has diameter [(^k) / (_3)] + [(^k - 1) /( _3)], when n = 2; and has diameter at most (^k) / (_4) (n+ 1), for n ≥ 3 and k even, and at most [(^k)/ (_4) (n + 1) + (^n) / (_4), for n ^, for n ≥ 3 and k odd.4. We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph S(_n,k) where all nodes are distinct, builds a collection of n - 1 node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that each path has length at most 6k - 7, and the algorithm has time complexity O(k(^3)n(^4))

Structural reliability and its sensitivity analysis based on the saddlepoint approximation-line sampling method by dichotomy of golden section

In order to solve the structural reliability and its sensitivity of the implicit nonlinear performance function (PF)  the advantages of the saddlepoint approximation (SA) and line sampling (LS) are merged. Also, the merits of dichotomy and the solution efficiency of the golden section method are combined to propose the saddlepoint approximation-line sampling (SA-LS) method based on the dichotomy of the golden section point. This is complicated and changeable in the non normal variable space, which is a very hot issue of the present international study.  For each sample, it is quick to find its zeropoint in PF along the important line sampling direction by the  previously mentioned dichotomy so that the structural failure probability can be transformed into the mean of a series linear PFs failure probability, and the reliability sensitivity is just the derivative or partial one of the probability with respect to the relational variables. Examples show that the SA-LS method based on the dichotomy of the golden section point is of high precision and fast velocity in analyzing the structural reliability and sensitivity of the implicit nonlinear PF that are complicated and changeable in the non-normal variable space

From Eyes to Face Synthesis: a New Approach for Human-Centered Smart Surveillance

With the popularity of surveillance cameras and the development of deep learning, significant progress has been made in the field of smart surveillance. Face recognition is one of the most important yet challenging tasks in human-centered smart surveillance, especially in public security, criminal investigation and anti-terrorism, and so on. Although, the state-of-the-art algorithms for face recognition have achieved dramatically improved results and have been widely applied in authentication scenario, the occlusion problem on face is still one of the critical issues for personal identification in smart surveillance, especially in the occasion of terrorist searching and identification. To address this issue, this paper proposed a new approach for eyes-to-face synthesis and personal identification for human-centered smart surveillance. An end-toend network based on conditional generative adversarial networks (GAN) is designed to generate the face information based only on the available data of eyes region. To obtain photorealistic faces and identitypreserving information, a synthesis loss function based on feature loss, GAN loss, and total variation loss is proposed to guide the training process. Both the subject and objective experimental results demonstrated that the proposed method can preserve the identity based on eyes-only data, and provide a potential solution for the identification of person even in the case of face occlusion

Transcriptome analysis of stem development in the tumourous stem mustard Brassica juncea var. tumida Tsen et Lee by RNA sequencing

<p>Abstract</p> <p>Background</p> <p>Tumourous stem mustard (<it>Brassica juncea </it>var. <it>tumida </it>Tsen et Lee) is an economically and nutritionally important vegetable crop of the <it>Cruciferae </it>family that also provides the raw material for <it>Fuling </it>mustard. The genetics breeding, physiology, biochemistry and classification of mustards have been extensively studied, but little information is available on tumourous stem mustard at the molecular level. To gain greater insight into the molecular mechanisms underlying stem swelling in this vegetable and to provide additional information for molecular research and breeding, we sequenced the transcriptome of tumourous stem mustard at various stem developmental stages and compared it with that of a mutant variety lacking swollen stems.</p> <p>Results</p> <p>Using Illumina short-read technology with a tag-based digital gene expression (DGE) system, we performed <it>de novo </it>transcriptome assembly and gene expression analysis. In our analysis, we assembled genetic information for tumourous stem mustard at various stem developmental stages. In addition, we constructed five DGE libraries, which covered the strains <it>Yong'an </it>and <it>Dayejie </it>at various development stages. Illumina sequencing identified 146,265 unigenes, including 11,245 clusters and 135,020 singletons. The unigenes were subjected to a BLAST search and annotated using the GO and KO databases. We also compared the gene expression profiles of three swollen stem samples with those of two non-swollen stem samples. A total of 1,042 genes with significantly different expression levels occurring simultaneously in the six comparison groups were screened out. Finally, the altered expression levels of a number of randomly selected genes were confirmed by quantitative real-time PCR.</p> <p>Conclusions</p> <p>Our data provide comprehensive gene expression information at the transcriptional level and the first insight into the understanding of the molecular mechanisms and regulatory pathways of stem swelling and development in this plant, and will help define new mechanisms of stem development in non-model plant organisms.</p

Association analyses of East Asian individuals and trans-ancestry analyses with European individuals reveal new loci associated with cholesterol and triglyceride levels

Large-scale meta-analyses of genome-wide association studies (GWAS) have identified >175 loci associated with fasting cholesterol levels, including total cholesterol (TC), high-density lipoprotein cholesterol (HDL-C), low-density lipoprotein cholesterol (LDL-C), and triglycerides (TG). With differences in linkage disequilibrium (LD) structure and allele frequencies between ancestry groups, studies in additional large samples may detect new associations. We conducted staged GWAS meta-analyses in up to 69,414 East Asian individuals from 24 studies with participants from Japan, the Philippines, Korea, China, Singapore, and Taiwan. These meta-analyses identified (P < 5 × 10-8) three novel loci associated with HDL-C near CD163-APOBEC1 (P = 7.4 × 10-9), NCOA2 (P = 1.6 × 10-8), and NID2-PTGDR (P = 4.2 × 10-8), and one novel locus associated with TG near WDR11-FGFR2 (P = 2.7 × 10-10). Conditional analyses identified a second signal near CD163-APOBEC1. We then combined results from the East Asian meta-analysis with association results from up to 187,365 European individuals from the Global Lipids Genetics Consortium in a trans-ancestry meta-analysis. This analysis identified (log10Bayes Factor ≥6.1) eight additional novel lipid loci. Among the twelve total loci identified, the index variants at eight loci have demonstrated at least nominal significance with other metabolic traits in prior studies, and two loci exhibited coincident eQTLs (P < 1 × 10-5) in subcutaneous adipose tissue for BPTF and PDGFC. Taken together, these analyses identified multiple novel lipid loci, providing new potential therapeutic targets

Generalised spatial modulation with multiple active transmit antennas

[Abstract]: We propose a new generalised spatial modulation (GSM) technique, which can be considered as a generalisation of the recently proposed spatial modulation (SM) technique. SM can be seen as a special case of GSM with only one active transmit antenna. In contrast to SM, GSM uses the indices of multiple transmit antennas to map information bits, and is thus able to achieve substantially increased spectral efficiency. Furthermore, selecting multiple active transmit antennas enables GSM to harvest significant transmit diversity gains in comparison to SM, because all the active antennas transmit the same information. On the other hand, inter-channel interference (ICI) is completely avoided by transmitting the same symbols through these active antennas. We present theoretical analysis using order statistics for the symbol error rate (SER) performance of GSM. The analytical results are in close agreement with our simulation results. The bit error rate performance of GSM and SM is simulated and compared, which demonstrates the superiority of GSM. Moreover, GSM systems with configurations of different transmit and receive antennas are studied. Our results suggest that using a less number of transmit antennas with a higher modulation order will lead to better BER performance

A novel relay scheme for the asymmetry multiple access relay channel

In this paper, we study the transmission mechanism for the asymmetry multiple access relay channel (AMARC), where the channel qualities from the sources to the relay are different. We propose a novel relay scheme, where network coding and cooperation between users are introduced, and turbo like decoders are employed at both the relay and destination nodes. We compare the bit error rate (BER) performance of the proposed scheme with the schemes in the literature via simulation. The simulation results show that, from the perspective of the average system BER, our proposed scheme significantly outperforms conventional relay schemes